Search results for "Arbitrary-precision arithmetic"
showing 3 items of 3 documents
Numerical evaluation of multiple polylogarithms
2004
Multiple polylogarithms appear in analytic calculations of higher order corrections in quantum field theory. In this article we study the numerical evaluation of multiple polylogarithms. We provide algorithms, which allow the evaluation for arbitrary complex arguments and without any restriction on the weight. We have implemented these algorithms with arbitrary precision arithmetic in C++ within the GiNaC framework.
Numerical evaluation of iterated integrals related to elliptic Feynman integrals
2021
We report on an implementation within GiNaC to evaluate iterated integrals related to elliptic Feynman integrals numerically to arbitrary precision within the region of convergence of the series expansion of the integrand. The implementation includes iterated integrals of modular forms as well as iterated integrals involving the Kronecker coefficient functions $g^{(k)}(z,\tau)$. For the Kronecker coefficient functions iterated integrals in $d\tau$ and $dz$ are implemented. This includes elliptic multiple polylogarithms.
The H-graph with equal masses in terms of multiple polylogarithms
2021
The initial phase of the inspiral process of a binary system producing gravitational waves can be described by perturbation theory. At the third post-Minkowskian order a two-loop double box graph, known as H-graph contributes. We consider the case where the two objects making up the binary system have equal masses. We express all master integrals related to the equal-mass H-graph up to weight four in terms of multiple polylogarithms. We provide a numerical program which evaluates all master integrals up to weight four in the physical regions with arbitrary precision.